0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.13/0.34	% Computer : n019.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1920
0.13/0.34	% WCLimit    : 240
0.13/0.34	% DateTime   : Wed Jul 30 09:24:04 EDT 2025
0.13/0.34	% CPUTime    : 
0.22/0.49	Running higher-order theorem proving
0.22/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p
0.59/0.59	# Version: 3.0.0-ho
0.59/0.59	# Preprocessing class: HSMSSMSSMLMNHHN.
0.59/0.59	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.59/0.59	# Starting ehoh_best2_full_lfho with 1200s (5) cores
0.59/0.59	# Starting lpo9_lambda_fix with 240s (1) cores
0.59/0.59	# Starting sh5l with 240s (1) cores
0.59/0.59	# Starting ho_unfolding_6 with 240s (1) cores
0.59/0.59	# lpo9_lambda_fix with pid 12407 completed with status 0
0.59/0.59	# Result found by lpo9_lambda_fix
0.59/0.59	# Preprocessing class: HSMSSMSSMLMNHHN.
0.59/0.59	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.59/0.59	# Starting ehoh_best2_full_lfho with 1200s (5) cores
0.59/0.59	# Starting lpo9_lambda_fix with 240s (1) cores
0.59/0.59	# SinE strategy is gf500_gu_R04_F100_L20000
0.59/0.59	# Search class: HGUSF-FFSF33-SHHSMSBN
0.59/0.59	# partial match(2): HGHNF-FFSF33-SHHSMSBN
0.59/0.59	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.59/0.59	# Starting new_ho_10 with 130s (1) cores
0.59/0.59	# new_ho_10 with pid 12413 completed with status 10
0.59/0.59	# Starting lpo9_lambda_fix with 25s (1) cores
0.59/0.59	# lpo9_lambda_fix with pid 12424 completed with status 0
0.59/0.59	# Result found by lpo9_lambda_fix
0.59/0.59	# Preprocessing class: HSMSSMSSMLMNHHN.
0.59/0.59	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.59/0.59	# Starting ehoh_best2_full_lfho with 1200s (5) cores
0.59/0.59	# Starting lpo9_lambda_fix with 240s (1) cores
0.59/0.59	# SinE strategy is gf500_gu_R04_F100_L20000
0.59/0.59	# Search class: HGUSF-FFSF33-SHHSMSBN
0.59/0.59	# partial match(2): HGHNF-FFSF33-SHHSMSBN
0.59/0.59	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.59/0.59	# Starting new_ho_10 with 130s (1) cores
0.59/0.59	# new_ho_10 with pid 12413 completed with status 10
0.59/0.59	# Starting lpo9_lambda_fix with 25s (1) cores
0.59/0.59	# Preprocessing time       : 0.001 s
0.59/0.59	# Presaturation interreduction done
0.59/0.59	
0.59/0.59	# Proof found!
0.59/0.59	# SZS status Theorem
0.59/0.59	# SZS output start CNFRefutation
0.59/0.59	thf(decl_25, type, mnot: ($i > $o) > $i > $o).
0.59/0.59	thf(decl_26, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.59/0.59	thf(decl_27, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.59/0.59	thf(decl_28, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.59/0.59	thf(decl_33, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.59/0.59	thf(decl_38, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.59/0.59	thf(decl_48, type, mweakly_connected: ($i > $i > $o) > $o).
0.59/0.59	thf(decl_50, type, mvalid: ($i > $o) > $o).
0.59/0.59	thf(decl_54, type, epred1_0: $i > $i > $o).
0.59/0.59	thf(decl_55, type, esk1_4: $i > ($i > $o) > ($i > $o) > $i > $i).
0.59/0.59	thf(decl_56, type, esk2_4: $i > ($i > $o) > ($i > $o) > $i > $i).
0.59/0.59	thf(decl_57, type, esk3_0: $i).
0.59/0.59	thf(decl_58, type, esk4_0: $i).
0.59/0.59	thf(decl_59, type, esk5_0: $i).
0.59/0.59	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mimplies)).
0.59/0.59	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mnot)).
0.59/0.59	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mor)).
0.59/0.59	thf(mand, axiom, ((mand)=(^[X6:$i > $o, X7:$i > $o]:(mnot @ (mor @ (mnot @ X6) @ (mnot @ X7))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mand)).
0.59/0.59	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mvalid)).
0.59/0.59	thf(mweakly_connected, axiom, ((mweakly_connected)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((X13 @ X15 @ X16)&(X13 @ X15 @ X17))=>(((X13 @ X16 @ X17)|((X16)=(X17)))|(X13 @ X17 @ X16))))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mweakly_connected)).
0.59/0.59	thf(mbox, axiom, ((mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:(![X14:$i]:((~((X13 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mbox)).
0.59/0.59	thf(mforall_prop, axiom, ((mforall_prop)=(^[X9:($i > $o) > $i > $o, X3:$i]:(![X10:$i > $o]:((X9 @ X10 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', mforall_prop)).
0.59/0.59	thf(conj, conjecture, ![X13:$i > $i > $o]:(((mweakly_connected @ X13)<=(mvalid @ (mforall_prop @ (^[X18:$i > $o]:(mforall_prop @ (^[X19:$i > $o]:(mor @ (mbox @ X13 @ (mimplies @ (mand @ X18 @ (mbox @ X13 @ X18)) @ X19)) @ (mbox @ X13 @ (mimplies @ (mand @ X19 @ (mbox @ X13 @ X19)) @ X18)))))))))), file('/export/starexec/sandbox/tmp/tmp.IPDduMsegd/E---3.1_12328.p', conj)).
0.59/0.59	thf(c_0_9, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.59/0.59	thf(c_0_10, plain, ((mnot)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.59/0.59	thf(c_0_11, plain, ((mor)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.59/0.59	thf(c_0_12, plain, ((mand)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])).
0.59/0.59	thf(c_0_13, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.59/0.59	thf(c_0_14, plain, ((mweakly_connected)=(^[Z0/* 6 */:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((Z0 @ X15 @ X16)&(Z0 @ X15 @ X17))=>(((Z0 @ X16 @ X17)|((X16)=(X17)))|(Z0 @ X17 @ X16))))))), inference(fof_simplification,[status(thm)],[mweakly_connected])).
0.59/0.59	thf(c_0_15, plain, ((mbox)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X14:$i]:((~((Z0 @ Z2 @ X14))|(Z1 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox])).
0.59/0.59	thf(c_0_16, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9, c_0_10]), c_0_11])).
0.59/0.59	thf(c_0_17, plain, ((mand)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_10]), c_0_11])).
0.59/0.59	thf(c_0_18, plain, ((mforall_prop)=(^[Z0/* 19 */:($i > $o) > $i > $o, Z1:$i]:(![X10:$i > $o]:((Z0 @ X10 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_prop])).
0.59/0.59	thf(c_0_19, negated_conjecture, ~(![X13:$i > $i > $o]:((![X32:$i, X31:$i > $o, X30:$i > $o]:((![X27:$i]:((~((X13 @ X32 @ X27))|(~(~((~((X31 @ X27))|~(![X26:$i]:((~((X13 @ X27 @ X26))|(X31 @ X26)))))))|(X30 @ X27))))|![X29:$i]:((~((X13 @ X32 @ X29))|(~(~((~((X30 @ X29))|~(![X28:$i]:((~((X13 @ X29 @ X28))|(X30 @ X28)))))))|(X31 @ X29))))))=>![X23:$i, X24:$i, X25:$i]:((((X13 @ X23 @ X24)&(X13 @ X23 @ X25))=>((X13 @ X24 @ X25)|((X24)=(X25))|(X13 @ X25 @ X24))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]), c_0_13]), c_0_14]), c_0_15]), c_0_16]), c_0_17]), c_0_11]), c_0_18])])).
0.59/0.59	thf(c_0_20, negated_conjecture, ![X34:$i, X35:$i > $o, X36:$i > $o, X37:$i, X39:$i]:((((((epred1_0 @ X39 @ (esk2_4 @ X34 @ X35 @ X36 @ X39))|~(X36 @ X39)|(X35 @ X39)|~(epred1_0 @ X34 @ X39)|((epred1_0 @ X37 @ (esk1_4 @ X34 @ X35 @ X36 @ X37))|~(X35 @ X37)|(X36 @ X37)|~(epred1_0 @ X34 @ X37)))&(~(X36 @ (esk2_4 @ X34 @ X35 @ X36 @ X39))|~(X36 @ X39)|(X35 @ X39)|~(epred1_0 @ X34 @ X39)|((epred1_0 @ X37 @ (esk1_4 @ X34 @ X35 @ X36 @ X37))|~(X35 @ X37)|(X36 @ X37)|~(epred1_0 @ X34 @ X37))))&(((epred1_0 @ X39 @ (esk2_4 @ X34 @ X35 @ X36 @ X39))|~(X36 @ X39)|(X35 @ X39)|~(epred1_0 @ X34 @ X39)|(~(X35 @ (esk1_4 @ X34 @ X35 @ X36 @ X37))|~(X35 @ X37)|(X36 @ X37)|~(epred1_0 @ X34 @ X37)))&(~(X36 @ (esk2_4 @ X34 @ X35 @ X36 @ X39))|~(X36 @ X39)|(X35 @ X39)|~(epred1_0 @ X34 @ X39)|(~(X35 @ (esk1_4 @ X34 @ X35 @ X36 @ X37))|~(X35 @ X37)|(X36 @ X37)|~(epred1_0 @ X34 @ X37)))))&(((epred1_0 @ esk3_0 @ esk4_0)&(epred1_0 @ esk3_0 @ esk5_0))&((~(epred1_0 @ esk4_0 @ esk5_0)&((esk4_0)!=(esk5_0)))&~(epred1_0 @ esk5_0 @ esk4_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])])).
0.59/0.59	thf(c_0_21, negated_conjecture, ![X14:$i, X4:$i > $o, X5:$i > $o, X3:$i, X15:$i]:(((X5 @ X14)|(X4 @ X15)|~((X4 @ (esk2_4 @ X3 @ X5 @ X4 @ X14)))|~((X4 @ X14))|~((epred1_0 @ X3 @ X14))|~((X5 @ (esk1_4 @ X3 @ X5 @ X4 @ X15)))|~((X5 @ X15))|~((epred1_0 @ X3 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_22, negated_conjecture, ![X15:$i, X4:$i > $o, X3:$i, X14:$i]:((((esk1_4 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X4 @ X15)=(X14))|((X15)=(X14))|(X4 @ X15)|~((X4 @ (esk2_4 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X4 @ X14)))|~((epred1_0 @ X3 @ X15))|~((epred1_0 @ X3 @ X14))|~((X4 @ X14)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_21])).
0.59/0.59	thf(c_0_23, negated_conjecture, ![X15:$i, X3:$i, X14:$i]:((((esk2_4 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(X15)))) @ X14)=(X15))|((esk1_4 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(X15)))) @ X15)=(X14))|((X15)=(X14))|~((epred1_0 @ X3 @ X15))|~((epred1_0 @ X3 @ X14)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_22])).
0.59/0.59	thf(c_0_24, negated_conjecture, (epred1_0 @ esk3_0 @ esk5_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_25, negated_conjecture, ![X3:$i, X5:$i > $o, X4:$i > $o, X14:$i, X15:$i]:(((epred1_0 @ X3 @ (esk2_4 @ X14 @ X4 @ X5 @ X3))|(X4 @ X3)|(X5 @ X15)|~((X5 @ X3))|~((epred1_0 @ X14 @ X3))|~((X4 @ (esk1_4 @ X14 @ X4 @ X5 @ X15)))|~((X4 @ X15))|~((epred1_0 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_26, negated_conjecture, ![X3:$i]:((((esk1_4 @ esk3_0 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X3)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk5_0)))) @ esk5_0)=(X3))|((esk2_4 @ esk3_0 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X3)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk5_0)))) @ X3)=(esk5_0))|((esk5_0)=(X3))|~((epred1_0 @ esk3_0 @ X3)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.59/0.59	thf(c_0_27, negated_conjecture, (epred1_0 @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_28, negated_conjecture, ((esk4_0)!=(esk5_0)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_29, negated_conjecture, ![X14:$i, X4:$i > $o, X5:$i > $o, X3:$i, X15:$i]:(((X5 @ X14)|(epred1_0 @ X15 @ (esk1_4 @ X3 @ X5 @ X4 @ X15))|(X4 @ X15)|~((X4 @ (esk2_4 @ X3 @ X5 @ X4 @ X14)))|~((X4 @ X14))|~((epred1_0 @ X3 @ X14))|~((X5 @ X15))|~((epred1_0 @ X3 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_30, negated_conjecture, ![X15:$i, X4:$i > $o, X3:$i, X14:$i]:((((X3)=(X14))|(epred1_0 @ X3 @ (esk2_4 @ X15 @ X4 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X3))|(X4 @ X3)|~((X4 @ (esk1_4 @ X15 @ X4 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X14)))|~((epred1_0 @ X15 @ X14))|~((epred1_0 @ X15 @ X3))|~((X4 @ X14)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_25])).
0.59/0.59	thf(c_0_31, negated_conjecture, (((esk2_4 @ esk3_0 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk4_0)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk5_0)))) @ esk4_0)=(esk5_0))|((esk1_4 @ esk3_0 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk4_0)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk5_0)))) @ esk5_0)=(esk4_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
0.59/0.59	thf(c_0_32, negated_conjecture, ~((epred1_0 @ esk4_0 @ esk5_0)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_33, negated_conjecture, ![X5:$i > $o, X4:$i > $o, X3:$i, X14:$i, X15:$i]:(((epred1_0 @ X3 @ (esk2_4 @ X14 @ X4 @ X5 @ X3))|(X4 @ X3)|(epred1_0 @ X15 @ (esk1_4 @ X14 @ X4 @ X5 @ X15))|(X5 @ X15)|~((X5 @ X3))|~((epred1_0 @ X14 @ X3))|~((X4 @ X15))|~((epred1_0 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_34, negated_conjecture, ![X15:$i, X4:$i > $o, X3:$i, X14:$i]:((((X3)=(X14))|(epred1_0 @ X3 @ (esk1_4 @ X15 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X4 @ X3))|(X4 @ X3)|~((X4 @ (esk2_4 @ X15 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X4 @ X14)))|~((epred1_0 @ X15 @ X3))|~((epred1_0 @ X15 @ X14))|~((X4 @ X14)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_29])).
0.59/0.59	thf(c_0_35, negated_conjecture, ((esk1_4 @ esk3_0 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk4_0)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk5_0)))) @ esk5_0)=(esk4_0)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31])])]), c_0_24]), c_0_27])]), c_0_28]), c_0_32])).
0.59/0.59	thf(c_0_36, negated_conjecture, ~((epred1_0 @ esk5_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.59/0.59	thf(c_0_37, negated_conjecture, ![X15:$i, X4:$i > $o, X3:$i, X14:$i]:((((X3)=(X14))|(epred1_0 @ X3 @ (esk2_4 @ X15 @ X4 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X3))|(epred1_0 @ X14 @ (esk1_4 @ X15 @ X4 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X14)))) @ X14))|(X4 @ X3)|~((epred1_0 @ X15 @ X14))|~((epred1_0 @ X15 @ X3))|~((X4 @ X14)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_33])).
0.59/0.59	thf(c_0_38, negated_conjecture, ((esk2_4 @ esk3_0 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk4_0)))) @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk5_0)))) @ esk4_0)=(esk5_0)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35])])]), c_0_24]), c_0_27])]), c_0_28]), c_0_36])).
0.59/0.59	thf(c_0_39, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38])])]), c_0_35]), c_0_24]), c_0_27])]), c_0_28]), c_0_32]), c_0_36]), ['proof']).
0.59/0.59	# SZS output end CNFRefutation
0.59/0.59	# Parsed axioms                        : 64
0.59/0.59	# Removed by relevancy pruning/SinE    : 50
0.59/0.59	# Initial clauses                      : 9
0.59/0.59	# Removed in clause preprocessing      : 0
0.59/0.59	# Initial clauses in saturation        : 9
0.59/0.59	# Processed clauses                    : 164
0.59/0.59	# ...of these trivial                  : 0
0.59/0.59	# ...subsumed                          : 29
0.59/0.59	# ...remaining for further processing  : 135
0.59/0.59	# Other redundant clauses eliminated   : 263
0.59/0.59	# Clauses deleted for lack of memory   : 0
0.59/0.59	# Backward-subsumed                    : 2
0.59/0.59	# Backward-rewritten                   : 1
0.59/0.59	# Generated clauses                    : 653
0.59/0.59	# ...of the previous two non-redundant : 253
0.59/0.59	# ...aggressively subsumed             : 0
0.59/0.59	# Contextual simplify-reflections      : 0
0.59/0.59	# Paramodulations                      : 148
0.59/0.59	# Factorizations                       : 85
0.59/0.59	# NegExts                              : 9
0.59/0.59	# Equation resolutions                 : 263
0.59/0.59	# Disequality decompositions           : 0
0.59/0.59	# Total rewrite steps                  : 175
0.59/0.59	# ...of those cached                   : 172
0.59/0.59	# Propositional unsat checks           : 0
0.59/0.59	#    Propositional check models        : 0
0.59/0.59	#    Propositional check unsatisfiable : 0
0.59/0.59	#    Propositional clauses             : 0
0.59/0.59	#    Propositional clauses after purity: 0
0.59/0.59	#    Propositional unsat core size     : 0
0.59/0.59	#    Propositional preprocessing time  : 0.000
0.59/0.59	#    Propositional encoding time       : 0.000
0.59/0.59	#    Propositional solver time         : 0.000
0.59/0.59	#    Success case prop preproc time    : 0.000
0.59/0.59	#    Success case prop encoding time   : 0.000
0.59/0.59	#    Success case prop solver time     : 0.000
0.59/0.59	# Current number of processed clauses  : 121
0.59/0.59	#    Positive orientable unit clauses  : 4
0.59/0.59	#    Positive unorientable unit clauses: 0
0.59/0.59	#    Negative unit clauses             : 3
0.59/0.59	#    Non-unit-clauses                  : 114
0.59/0.59	# Current number of unprocessed clauses: 105
0.59/0.59	# ...number of literals in the above   : 990
0.59/0.59	# Current number of archived formulas  : 0
0.59/0.59	# Current number of archived clauses   : 14
0.59/0.59	# Clause-clause subsumption calls (NU) : 513
0.59/0.59	# Rec. Clause-clause subsumption calls : 48
0.59/0.59	# Non-unit clause-clause subsumptions  : 31
0.59/0.59	# Unit Clause-clause subsumption calls : 2
0.59/0.59	# Rewrite failures with RHS unbound    : 0
0.59/0.59	# BW rewrite match attempts            : 10
0.59/0.59	# BW rewrite match successes           : 1
0.59/0.59	# Condensation attempts                : 0
0.59/0.59	# Condensation successes               : 0
0.59/0.59	# Termbank termtop insertions          : 41959
0.59/0.59	# Search garbage collected termcells   : 1102
0.59/0.59	
0.59/0.59	# -------------------------------------------------
0.59/0.59	# User time                : 0.067 s
0.59/0.59	# System time              : 0.006 s
0.59/0.59	# Total time               : 0.073 s
0.59/0.59	# Maximum resident set size: 2108 pages
0.59/0.59	
0.59/0.59	# -------------------------------------------------
0.59/0.59	# User time                : 0.069 s
0.59/0.59	# System time              : 0.008 s
0.59/0.59	# Total time               : 0.077 s
0.59/0.59	# Maximum resident set size: 1792 pages
0.59/0.59	% E exiting
0.59/0.59	% E exiting
0.59/0.59	EOF